On Bounds for Real Roots of Polynomials

نویسنده

  • DORU ŞTEFĂNESCU
چکیده

The computation of the real roots of univariate polynomials with real coefficients is done using several algorithmic devices. Many of them are based on the isolation of the real roots, i.e. the computation of a finite number of intervals with the property that each of them contains exactly one root. For that one of the steps is that of computing bounds for the roots. This can be realized using classical bounds for the absolute values of complex roots, see [9]. However there exist bounds specific to real roots. We obtain a device for computing absolute positiveness bounds for the real roots. The method is based on an improvement of the results of D. Ştefănescu [12] on upper bounds for positive roots. It it useful for the isolation of these roots, i.e. for the computation of a finite number of intervals such that each interval contains exactly one root [1]. These methods allows us to compute an interval containing all the positive roots of the derivatives of the polynomial. Analytical properties of polynomials and the algorithmic methods for the computation of their roots are relevant for the study of many physical problems, see, for example [7], [10], [11].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Classifications of Random Polynomials

 Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...

متن کامل

Inequalities on real roots of polynomials

We survey the most used bounds for positive roots of polynomials and discuss their efficiency. We obtain new inequalities on roots of polynomials. Then we give new inequalities on roots of orthogonal polynomials, obtained from the differential equations satisfied by these polynomials. Mathematics subject classification (2000): 12D10, 68W30.

متن کامل

A pr 2 01 5 Finite free convolutions of polynomials ∗

We study three convolutions of polynomials that are inspired by free probability. We define these to be the expected characteristic polynomials of certain random matrices. The symmetric additive and multiplicative convolutions have been studied for a century. The asymmetric additive convolution, and the connection of all of them with random matrices, appears new. We prove that these convolution...

متن کامل

Improving the Performance of the Continued Fractions Method Using New Bounds of Positive Roots

Abstract. In this paper we compare four implementations of the Vincent-AkritasStrzeboński Continued Fractions (VAS-CF) real root isolation method using four different (two linear and two quadratic complexity) bounds on the values of the positive roots of polynomials. The quadratic complexity bounds were included to see if the quality of their estimates compensates for their quadratic complexity...

متن کامل

Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials

In this paper we review the existing linear and quadratic complexity (upper) bounds on the values of the positive roots of polynomials and their impact on the performance of the Vincent-Akritas-Strzeboński (VAS) continued fractions method for the isolation of real roots of polynomials. We first present the following four linear complexity bounds (two “old” and two “new” ones, respectively): Cau...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013